A CSP approach to sequential consistency
نویسندگان
چکیده
In this paper, we show how the process notation of Communicating Sequential Processes (CSP) may be used to describe a lazy caching protocol. We then show that the traces model for CSP can be used to specify the property of sequential consistency. The model-based approach of CSP allows us to demonstrate that the protocol description satisses the speci-cation, thus verifying that the lazy caching protocol is sequentially consistent .
منابع مشابه
A Generalization of Generalized Arc Consistency: From Constraint Satisfaction to Constraint-Based Inference
Arc consistency and generalized arc consistency are two of the most important local consistency techniques for binary and non-binary classic constraint satisfaction problems (CSPs). Based on the Semiring CSP and Valued CSP frameworks, arc consistency has also been extended to handle soft constraint satisfaction problems such as fuzzy CSP, probabilistic CSP, max CSP, and weighted CSP. This exten...
متن کاملLinking Semantic Models to Support CSP || B Consistency Checking
Consistency checking in the CSP ‖ B approach verifies that an individual controller process, defined using a sequential non-divergent subset of CSP, never calls a B operation outside its precondition. Previously this was done by preprocessing the CSP process to perform a weakest precondition semantics proof. An embedding of the CSP traces model already exists in the PVS theorem prover, which ma...
متن کاملDomain k-Wise Consistency Made as Simple as Generalized Arc Consistency
In Constraint Programming (CP), Generalized Arc Consistency (GAC) is the central property used for making inferences when solving Constraint Satisfaction Problems (CSPs). Developing simple and practical filtering algorithms based on consistencies stronger than GAC is a challenge for the CP community. In this paper, we propose to combine k-Wise Consistency (kWC) with GAC, where kWC states that e...
متن کاملTowards a Practical Approach to Check UML/fUML Models Consistency Using CSP
This work provides an underpinning for a systems modelling approach based on UML and fUML together. It uses UML state diagrams as a starting point for modelling system object behaviour abstractly, then refining each state diagram by adding the implementation decisions in a form of a fUML activity diagram. Maintaining behavioural consistency between each UML state diagram and its corresponding f...
متن کاملEfficient Algorithms for Functional Constraints
Functional constraints are an important constraint class in Constraint Programming (CP) systems, in particular for Constraint Logic Programming (CLP) systems. CP systems with finite domain constraints usually employ CSP-based solvers which use local consistency, e.g. arc consistency. We introduce a new approach which is based instead on variable substitution. We obtain efficient algorithms for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007